949B - A Leapfrog in the Array - CodeForces Solution

#include <iostream>
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define pb push_back

using namespace std;


int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
	cout.tie(NULL);
	
	long long n,q;
	cin>>n>>q;
	long long x;
	for(int i=0;i<q;i++){
	    cin>>x;
	    if(x<=n && x%2==1){
	        cout<<(x+1)/2<<endl;
	    }
	    else{
	        long long emp= (2*n-1-x+1)/2; // no of empty boxes after and including x till 2*n-1
	        while(true){
	            x+=emp;
	            if(emp%2==1){
	                break;
	            }
	            emp/=2;
	        }
	        cout<<(x+1)/2<<endl;
	    }
	}
	
	
	
    return 0;
}